Force/release support in emulation and formal verification

ABSTRACT

Forming a logic circuit design from a behavioral description language that includes N force and M release statements applied to a net disposed in the design, includes, in part, forming N multiplexers and a controller controlling the select terminals of the N multiplexers. Each multiplexer receives a force signal at its first input terminal. The output signal of the ith multiplexer is supplied to a second input terminal of (i+1)th multiplexer. A driver signal driving the net in the absence of the force statements is applied to a second input terminal of a first multiplexer. The controller asserts the select signal of the ith multiplexer if the ith force condition is active, and unasserts the select signal of the ith multiplexer if any one of a number of predefined conditions is satisfied.

CROSS-REFERENCE TO RELATED APPLICATION

The present application claims benefit under 35 USC 119(e) of Application Ser. No. 62/711,218, filed Jul. 27, 2018, the content of which is incorporated herein by reference in its entirety.

COPYRIGHT NOTICE

The assignee of this patent document has no objection to the facsimile reproduction by anyone of the patent document itself or of the patent application, as it appears in the files of the United States Patent and Trademark Office, but otherwise reserves all rights whatsoever in any included works of authorship protected by copyright.

SPECIFICATION—DISCLAIMER

In the following Background, Summary, and Detailed Description, headings should not be construed as necessarily limiting. In the following Background, Summary and Detailed Description, the citation or identification of any publication does not signify relevance or status as prior art for any of the claimed or described embodiments. Paragraphs for which the text is all italicized signifies text that is common to multiple Synopsys patent specifications.

BACKGROUND

For functional testing of RTL (Register Transfer Level) hardware models written in a Hardware Description Language (HDL) there is often a need to force values of some signals and then restore the normal operation of the design. This enables verification of smaller models, use of simpler testbenches, and performance of what-if analyses. Modern HDLs such as SystemVerilog and VHDL provide language constructs for forcing and releasing signal values.

Forcing and releasing of signal values is supported in simulation. To run the same tests in emulation, force/release constructs should also be supported in emulation. To make the same test produce the same results in simulation and in emulation (congruency mode), the full simulation semantics of force/release constructs should be supported in emulation for both simple and complex cases.

Usually formal verification tools ignore force/release constructs, thus creating a serious verification gap. A need continues to exist for the use of the same models in simulation/emulation and in formal verification to ensure that the verification results are consistent and reliable.

SUMMARY

The claims signify a brief description of one or more of the innovations, embodiments, and/or examples found within this disclosure.

A method of forming a logic circuit design from a behavioral description language that includes N force statements and M release statement applied to a net disposed in the design, in accordance with one embodiment of the present invention, includes in part, forming N multiplexers and a controller. Each multiplexer receives a different one of N force signals, defined by the N force statements, at the multiplexer's first input terminal, wherein an output signal of i^(th) multiplexer is supplied to a second input terminal of (i+1)^(th) multiplexer, wherein i is an integer ranging from 1 to N, and wherein a driver signal driving the net in the absence of the force statements is applied to a second input terminal of a first one of the N multiplexers. The controller controls the select terminals of the N multiplexers in response to N force conditions and M release conditions. The controller is configured to assert the select signal of the i^(th) multiplexer if the i^(th) force condition is active, and unassert the select signal of the i^(th) multiplexer if (i) the i^(th) force condition is inactive and a force condition other than the i^(th) force condition is active, or (ii) the i^(th) force condition is inactive and any one of the M release conditions is active, or (iii) the i^(th) force condition is dominated by a force condition other than the i^(th) force condition or (iv) the i^(th) force condition is dominated by any one of the M release conditions.

In one embodiment, the method further includes, in part, maintaining a previous value of the select signal of the i^(th) multiplexer if the select signal of the i^(th) multiplexer is neither asserted nor unasserted. In one embodiment, the i^(th) force statement dominates the j^(th) release statement if the i^(th) force statement appears below the j^(th) release in a same procedure statement, wherein j is an index varying from 1 to M.

In one method, the i^(th) force statement dominates the j^(th) release statement if the i^(th) force statement is disposed in a first procedure executed after a second procedure in which the j^(th) procedure is disposed, wherein j is an index varying from 1 to M. In one embodiment, the i^(th) release statement dominates the i^(th) force statement if the j^(th) release statement appears below the i^(th) release in a same procedure statement, wherein j is an index varying from 1 to M. In one embodiment, the j^(th) release statement dominates the i^(th) force statement if the j^(th) release statement is disposed in a first procedure executed after a second procedure in which the i^(th) procedure is disposed, wherein j is an index varying from 1 to M.

A method of forming a logic circuit design from a behavioral description language that includes N force statements and M release statement applied to a variable disposed in the design, in accordance with one embodiment of the present invention, includes, in part, forming N multiplexers, a controller and a sustainer. Each multiplexer receives a different one of N force signals defined by the N force statements at the multiplexer's first input terminal, wherein an output signal of i^(th) multiplexer is supplied to a second input terminal of (i+1)^(th) multiplexer, wherein i is an integer ranging from 1 to N, wherein a driver signal applied to the variable in the absence of the force statements is applied to a second input terminal of a first one of the N multiplexers, and wherein an output of the Nth multiplexer is applied to an input of a sustainer logic. The controller is configured to control the select terminals of each of the N multiplexers in response to N force conditions and M release conditions, wherein the controller is further configured to: assert the select signal of the i^(th) multiplexer if the i^(th) force condition is active and unassert the select signal of the i^(th) multiplexer if (i) the i^(th) force condition is inactive and a force condition other than the i^(th) force condition is active, or (ii) the i^(th) force condition is inactive and any one of M release conditions is active, or (iii) the i^(th) force condition is dominated by a force condition other than the i^(th) force condition or (iv) the i^(th) force condition is dominated by any one of the M release conditions. The sustainer logic is configured to receive and latch an output of the Nth multiplexer until the variable becomes a target of an executed assignment statement.

In one embodiment, the sustainer is defined by a state machine that includes normal, forced and released states. In one embodiment, a transition from the normal state to forced state occurs when a select terminal of any of the N multiplexers is asserted. In one embodiment, a transition from the forced state to the normal state occurs when the select terminal of none of the N multiplexers is asserted and at least one of the N force conditions is active. In one embodiment, a transition from the forced state to the released state occurs when the select terminal of none of the N multiplexers is asserted and none of the N force conditions is active. In one embodiment, a transition from the released state to the forced state occurs when a select terminal of any of the N multiplexers is asserted. In one embodiment, a transition from the released state to the normal state occurs when the select terminal of none of the N multiplexers is asserted and at least one of the N force conditions is active.

In one embodiment, the sustainer further includes, in part, a multiplexer logic configured to receive a select signal that is asserted if the state machine is in the normal state or if the select terminal of any of the N multiplexers is asserted. The multiplexer logic includes, in part, a first input terminal configured to receive an output signal of the Nth multiplexer, a second input terminal configured to receive a stored output of the multiplexer logic, and a flip flop configured to store the output of the multiplexer logic.

A computer system, in accordance with one embodiment of the present invention, is configured to form a logic circuit design from a behavioral description language that includes N force statements and M release statement applied to a net disposed in the circuit design. To achieve this, the computer system is configured to form N multiplexers and a controller. Each multiplexer receives a different one of N force signals, defined by the N force statements, at the multiplexer's first input terminal, wherein an output signal of i^(th) multiplexer is supplied to a second input terminal of (i+1)^(th) multiplexer, wherein i is an integer ranging from 1 to N, and wherein a driver signal driving the net in the absence of the force statements is applied to a second input terminal of a first one of the N multiplexers. The controller is configured to control the select terminals of each of the N multiplexers in response to N force conditions and M release conditions. The controller is further configured to: assert the select signal of the i^(th) multiplexer if the i^(th) force condition is active, and unassert the select signal of the i^(th) multiplexer if (i) the i^(th) force condition is inactive and a force condition other than the i^(th) force condition is active, or (ii) the i^(th) force condition is inactive and any one of the M release conditions is active, or (iii) the i^(th) force condition is dominated by a force condition other than the i^(th) force condition or (iv) the i^(th) force condition is dominated by any one of the M release conditions.

In one embodiment, the computer system is further configured to maintain a previous value of the select signal of the i^(th) multiplexer if the select signal of the i^(th) multiplexer is neither asserted nor unasserted. In one embodiment, the i^(th) force statement dominates the j^(th) release statement if the i^(th) force statement appears below the j^(th) release in a same procedure statement, wherein j is an index varying from 1 to M.

In one embodiment, the i^(th) force statement dominates the j^(th) release statement if the i^(th) force statement is disposed in a first procedure executed after a second procedure in which the j^(th) procedure is disposed, wherein j is an index varying from 1 to M. In one embodiment, the i^(th) release statement dominates the i^(th) force statement if the j^(th) release statement appears below the i^(th) release in a same procedure statement, wherein j is an index varying from 1 to M.

In one embodiment, the j^(th) release statement dominates the i^(th) force statement if the j^(th) release statement is disposed in a first procedure executed after a second procedure in which the i^(th) procedure is disposed, wherein j is an index varying from 1 to M.

A computer system, in accordance with one embodiment of the present invention, is configured to form a logic circuit design from a behavioral description language that includes N force statements and M release statement applied to a net disposed in the circuit design. To achieve this, the computer system is configured to form N multiplexers, a controller and a sustainer.

Each of the N multiplexers receives a different one of N force signals defined by the N force statements at the multiplexer's first input terminal, wherein an output signal of i^(th) multiplexer is supplied to a second input terminal of (i+1)^(th) multiplexer, wherein i is an integer ranging from 1 to N, wherein a driver signal applied to the variable in the absence of the force statements is applied to a second input terminal of a first one of the N multiplexers, and wherein an output of the Nth multiplexer is applied to an input of a sustainer logic. The controller controls select terminals of each of the N multiplexers in response to N force conditions and M release conditions. The controller is further configured to: assert the select signal of the i^(th) multiplexer if the i^(th) force condition is active, and unassert the select signal of the i^(th) multiplexer if (i) the i^(th) force condition is inactive and a force condition other than the i^(th) force condition is active, or (ii) the i^(th) force condition is inactive and any one of M release conditions is active, or (iii) the i^(th) force condition is dominated by a force condition other than the i^(th) force condition or (iv) the i^(th) force condition is dominated by any one of the M release conditions. The sustainer logic is configured to receive and latch an output of the Nth multiplexer until the variable becomes a target of an executed assignment statement.

In one embodiment, the sustainer is defined by a state machine that includes normal, forced and released states. In one embodiment, a transition from the normal state to forced state occurs when a select terminal of any of the N multiplexers is asserted. In one embodiment, a transition from the forced state to the normal state occurs when the select terminal of none of the N multiplexers is asserted and at least one of the N force conditions is active.

In one embodiment, a transition from the forced state to the released state occurs when the select terminal of none of the N multiplexers is asserted and none of the N force conditions is active. In one embodiment, a transition from the released state to the forced state occurs when a select terminal of any of the N multiplexers is asserted. In one embodiment, a transition from the released state to the normal state occurs when the select terminal of none of the N multiplexers is asserted and at least one of the N force conditions is active.

In one embodiment, the sustainer further includes, in part, a multiplexer logic configured to receive a select signal that is asserted if the state machine is in the normal state or if the select terminal of any of the N multiplexers is asserted. The multiplexer logic further includes, in part, a first input terminal configured to receive an output signal of the Nth multiplexer and a second input terminal configured to receive a stored output of the multiplexer logic, and a flip flop configured to store the output of the multiplexer logic.

This Summary does not attempt to completely signify any particular innovation, embodiment, or example as it can be used in commerce. Additionally, this Summary is not intended to signify essential elements of an innovation, embodiment or example or to limit the scope of the subject matter of this disclosure.

The innovations, embodiments, and/or examples found within this disclosure are not all-inclusive, but rather describe the basic significance of the subject matter. Accordingly, one use of this Summary is as a prelude to a Detailed Description presented later.

DRAWINGS

The following Detailed Description, Figures, appended Additional Figures and appended Claims signify the nature and advantages of the innovations, embodiments and/or examples of the claimed inventions. All of the Figures signify innovations, embodiments, and/or examples of the claimed inventions for purposes of illustration only and do not limit the scope of the claimed inventions. Such Figures are not necessarily drawn to scale, and are part of the Disclosure.

In the Figures, similar components or features may have the same, or similar, reference signs in the form of labels (such as alphanumeric symbols, e.g., reference numerals), and may signify similar or equivalent functionality. Further, various components of the same type may be distinguished by following the reference label by a dash and a second label that distinguishes among the similar components. If only the first reference label is used in the specification, the description is applicable to any one of the similar components having the same first reference label irrespective of the second reference label. A brief description of the Figures is below.

FIG. 1 is a schematic block diagram of a logic circuit synthesized in response to a code which includes a pair of force and release statements on a net, in accordance with one embodiment of the present invention.

FIG. 2 is a schematic block diagram of a logic circuit synthesized in response to a code which includes a pair of force and release statements on a variable, in accordance with one embodiment of the present invention

FIG. 3 shows the state transitions of a finite state machine (FSM) associated with synthesizing a variable, in accordance with one embodiment of the present invention.

FIG. 4 is a schematic logic block diagram of the finite state machine performing the state transitions shown in FIG. 3, in accordance with one embodiment of the present invention.

FIG. 5 is a schematic block diagram of the sustainer logic shown in FIG. 2, in accordance with one embodiment of the present invention.

FIGS. 6A, 6B and 6C depict simplified block diagrams of a computer system suitable for use with embodiments of the technology, as well as circuit design and circuit embodiments of the technology.

FIG. 7 illustrates various processes performed in the design, verification and fabrication of an integrated circuit design.

FIG. 8 depicts a block diagram of an emulation system.

In such various figures, reference signs may be omitted as is consistent with accepted engineering practice; however, one of ordinary skill in the art will understand that the illustrated components are readily understood when viewed in context of the illustration as a whole and the accompanying disclosure describing such various figures.

DETAILED DESCRIPTION

The Figures and the following Detailed Description signify innovations, embodiments and/or examples by way of illustration only, with various features, structures or characteristics described together in a single embodiment to streamline the disclosure. Variations of any of the elements, processes, machines, systems, manufactures or compositions disclosed by such exemplary innovations, embodiments and/or examples will be readily recognized and may be used in commerce without departing from the principles of what is claimed. The Figures and Detailed Description may also signify, implicitly or explicitly, advantages and improvements of a subset of the exemplary embodiments described herein.

In the Figures and Detailed Description, numerous specific details may be described to enable one or more of the exemplary innovations, embodiments and/or examples. In the interest of not obscuring the presentation of the exemplary innovations, embodiments and/or examples in the following Detailed Description, some processing steps or operations that are known in the art may be combined together for presentation and for illustration purposes and might not be described in detail. However, a person skilled in the art will recognize that these exemplary innovations, embodiments and/or examples may be used in commerce without these specific details or with equivalents thereof. In other instances, well-known processes and devices are not described in detail as not to unnecessarily obscure aspects of these exemplary innovations, embodiments and/or examples. In other instances, some processing steps or operations that are known in the art may not be described at all. Instead, the following description is focused on the distinctive features or elements of various exemplary innovations, embodiments and/or examples. Furthermore, while this description may refer to some components of the structure in the singular tense, more than one component may be depicted throughout the Figures and like components are labeled with like numerals.

Embodiments of the present invention transform the force/release constructs into semantically equivalent circuits, which may be represented either in RTL, or on a gate-level logic. Such transformation solves the problems posed by force/release constructs in both emulation and formal verification. Such a transformation is possible when there is a system clock (or a global clock, as is commonly referred to in SystemVerilog) which is the fastest clock synchronizing changes of all signals (nets or variables) in the circuit. In emulation such a clock often explicitly exists. While in formal verification the presence of such a clock is implicit. Therefore, in both emulation and formal verification, the requirement for such a clock is met.

The force/release semantics in SystemVerilog and in VHDL differ slightly. Embodiments of the present invention are described below with reference to SystemVerilog and in terms of the construct synthesis into an RTL. It is understood, however, that embodiments of the present invention are equally applicable to VHDL and other languages and can be synthesized to gate-level logic. Furthermore, reference is made below to the notation $global_clock in SystemVerilog, which corresponds to the positive edge of the system clock.

SystemVerilog includes “force” and “release” constructs to force and release signal values. In the following example, when condition “cond1” holds on the rising clock edge, the value of signal “sig” is defined by a logical AND operation of signals “a” and “b”. When condition “cond2” holds on the rising clock edge, signal “sig” will eventually get its natural value.

-   -   always @ (pos.dgq clk) begin         -   if (cond1) force sig=a & b;         -   if (cond2) release sig;         -   . . . ;     -   end

In SystemVerilog there are two kinds of signals, namely nets and variables. A net is continuously driven, whereas a variable stores its value when no longer driven. Force/release statements in SystemVerilog have different semantics depending on whether a variable or a net is forced.

A force statement on a signal overrides all drivers and assignments to the signal. The release behavior is different for nets and variables. When released, a net is immediately assigned the value determined by its drivers. The same rule applies when releasing a variable driven by a continuous assignment. If the released variable is not driven by a continuous assignment however, and does not have an active procedural assignment, the variable maintains its current value until the next procedural assignment directed to it is executed.

Canonical Guarded Form

Force and release are procedural statements, and therefore, they may be placed either in a structured procedure, or in a subroutine, such as a function or a task. The following description of the embodiments of the present invention are made with reference to force and release statements belonging to a structured procedure. It is understood however that the embodiments of the present invention are equally applicable to all other procedures upon their inlining.

An initial procedure may be considered as a special case of the clocked “always” procedure:

-   -   always @ (posedqe initial_clock) . . .         where initial_clock is a dummy clock, transitioning at the         initial time only.

It is assumed that the force and release statements are placed directly within an “always” procedure. An optimization technique when the force statements appear in an initial procedure is described below in the section heading “Force in Initial Procedure” below.

An RTL procedure may include loops, conditional statements (such as “if case”), force/release statements, assignments and several other statements. This distinguishes an RTL procedure from a testbench procedure, which may contain a richer set of constructs, such as delay controls, fork-join blocks, and the like. An RTL procedure may not contain time control statements except for one, preceding the scope of all other statements of the procedure. An RTL procedure may contain only “begin-end” blocks”, and not “fork-join” blocks. If an RTL procedure includes loops, the loops should be statically unrollable. In the following, it is assumed that all loops have been unrolled.

After the loop(s) is unrolled, the procedural code will contain only conditional or unconditional statements, such as assignments, force and release statements, and the like. The resulting code may be represented in the following form: if (guard_1) unconditional_statement_1;  (1) if (guard_n) unconditional_statement_n;  (2)

In statement (1), unconditional_statement_1 is executed if guard_1 is true, namely if it is 1′ b1. Similarly, in statement (s), unconditional_statement_2 is executed if guard_2 is true, namely if it is 1′ b1. Though in SystemVerilog any nonzero value is interpreted as true, any such case may be reduced to a one bin Boolean condition. Such a representation is referred to herein as a canonical guarded form, or a canonical form. Accordingly, all procedural statements are assumed herein to be represented in this form.

Activity Indicator

To synthesize the force and release behavior, information is maintained about whether the procedure to which these statements belong has been executed. To achieve this, the event control of the structured procedure, whether explicit or implicit, is captured as a Boolean variable. For example, the activity indicator act of the following always procedure:

-   -   always @ (pos.dqe clk) begin         -   . . .     -   end         is computed as:     -   always @$global_clock begin         -   past_clk <=clk;         -   act <=˜past_clk & clk;         -   . . .     -   end

In other words, the variable act, while remaining asserted, indicates that the always procedure is active. The activity indicator of the procedure to which the force statement i belongs to, or is associated with, is denoted herein as actf[i]. Likewise, the activity indicator of the procedure to which the release statement j belongs to, or is associated with, is denoted as actr[j]. It is understood that the activity indicators of all force and release statements belonging to the same structured procedure are represented by the same Boolean variable.

Force/Release on Bit/Part Select and on Signal Concatenation

Force and release statements may apply to an entire signal, to selected bits of a multibit signal, or to a concatenation of several signals. Concatenation of nets and variables is disallowed. When a constant bit-select or a constant part-select of a signal (i.e., not the entire signal) is the target of a force and/or release statement, the signal may be split into corresponding parts and considered independently. For example, in the following cases

-   -   bit [8] sig;     -   . . .     -   force sig[5:2]=RHS1;     -   . . .     -   force sig[6:3]=RHS2;     -   . . .     -   release sig[2];         signal sig may be split into sig[7], sig[6], sig[5:3], sig[2]         and sig[1:0]. The above statements may then be rewritten as         independent signals:     -   force sig[5:3]=RHS1[3:1];     -   force sig[2]=RHS1[0];     -   . . .     -   force sig[6]=RHS2[3];     -   force sig[5:3]=RHS[2:0];     -   . . .     -   release sig[2];

If a signal concatenation is a target of a force or a release statement, this statement may be split into independent statements per each concatenation operand. For example, the statement

-   -   force {sig1, sig2}= . . . ;         may be split into:     -   force sig1= . . . ;     -   force sig2= . . . ;

Accordingly, in the following it is assumed that all force and release statements are applied to the entire signal. It is further assumed that the force/release statements have the same fixed target. It is understood that force/release statements associated with different targets may be performed independently. It is also understood that any release statements for signals that were not targets of force statements may be ignored.

Dominance

A number of force and release statements with the same target may be present in one or more “always” procedures. For example, signal sig is shown below as being the target of force and release statements in two “always” statements:

-   -   always @( . . . ) begin         -   . . .         -   if (guardf[0]) force sig=forced_val0;         -   . . .         -   if (guardr[0]) release sig;         -   . . .     -   end     -   always @ ( . . . )         -   . . .         -   if (guardr[1]) release sig;         -   . . .         -   if (guardf[1]) force sig=forced_val1;     -   end

When force and/or release statements belong to different procedures, their execution order is undefined, and may be fixed arbitrarily. When several force and/or release statements belong to the same procedure, their order is respected. In an RTL, different structured procedures may be ordered, for example, by splitting or rewriting them so as to impose their execution in a specific order without relaxation. The synthesized RTL will then reflect such execution order.

In the following it is assumed that for any two force and/or release statements, namely “stmt1” and “stmt2 ”, “stmt1” dominates (overrides) “stmt2 ”if and only if (iff) either stmt1 appears below stmt2 in the same procedure, or stmt1 belongs to a different “always” procedure which executes after the “always” procedure containing stmt2.

Assume there are N force and M release statements collectively defining an M×N release dominance matrix “rdom”. Element rdom[i,j] is defined as being equal to 1 iff the i^(th) release statement dominates the j^(th) force statement, and is 0 otherwise, where i is a first index ranging from 0, . . . , M−1; and j is a second index ranging from 0, . . . , N−1.

For example, in the following 2×2 rdom matrix,

${rdom} = {\begin{pmatrix} 1 & 0 \\ 1 & 0 \end{pmatrix}.}$ the first release statement dominates the first force statement but does not dominate the second force statement. Similarly, the second release statement dominates the first force statement but does not dominate the second force statement.

In a similar manner, an N×N force dominance matrix “fdom” is defined as including N force statements. Element fdom[i,j] is defined as being equal to 1 iff the i^(th) force statement dominates the j^(th) force statement, and is 0 otherwise, where i and j are indices ranging from 0, . . . , N−1. It is assumed that fdom[i,i]=0.

Force/Release Synthesis for Nets

A force statement on a net overrides all drivers of the net until a release statement is executed on that net. When released, the net is immediately assigned the value determined by the drivers of the net.

FIG. 1 is a schematic block diagram of a logic circuit 100 synthesized in response to code 200 below which includes a pair of force and release statements, in accordance with one embodiment of the present invention.

Code 200

-   -   bit [N] ctl='0;     -   bit [N] prev_ctl='0;     -   bit [N] guardf; // Values of force guards on sig     -   bit [M] guardr; // Values of release guards on sig     -   always_comb         -   for (int i=0; i<N; i++)             -   ctl[i]=compute_ctl(i);     -   function bit compute_ctl(int i);         -   for (int j=0; j<M;j++)             -   if (guardrf[j] & actr[j] & (rdom[j, i]|˜actf[i]))                 -   return 1'b0;         -   for (int j=0;j<N;j++)             -   if (j !=i && guardf[j] & actf[j] & (fdom[j,                 i]|˜actf[i]))                 -   return 1'b0;         -   return guardf[i] & actf[i]|prev_ctl[i];     -   endfunction: compute_ctl     -   always @global_clock         -   for (int i=0; i<N; i++) prev_ctl[i]<=ctl[i];

Logic circuit 100 is shown as including a controller 110 and a pair of multiplexers (muxes) 102 and 104. The number of multiplexers and the number of force guards—as represented by the number of bits in signal guardf—is shown as being equal to the number of force statements. Likewise, the number of release guards—as represented by the number of bits in signal guardr—is equal to the number of release statements.

In FIG. 1 signal driver is received as signal sig if force and release statements were not present. In other words, in the absence of force and release statements, select signals ctl[0] and ctl[1] of muxes 102 and 104 respectively select and transfer as their output signals the input signals present at their respective input terminals S₁. Mux 102 transfers signalforced_val0 to its output terminal if signal ctl[0] is at a 1'b1. Similarly, mux 104 transfers signal forced_val1 to its output terminal signal if signal ctl[1] is at a 1'b1. Controller 110 is configured to determine the values of signals ctl[0] and ctl[1] based on the values of the force guard guardf, force activity indicator actf, release guard guardr, and release activity indicator actr, as described further below.

As described above, a force statement is executed when the force statement's corresponding condition, as represented by guardf is satisfied and the force statement remains active, as represented by actf. Similarly, as described above, a release statement is executed when the release statement's corresponding condition as represented by guardr is satisfied and the release statement remains active, as represented by actr.

As seen from code 200 above, the i^(th) control signal ctl[i] is set to 0 if i) either its corresponding force statement is currently inactive (represented by ˜actf[i]) and there is another currently active force (represented by guardf[j] & actf[j]) or another currently active release statement (represented by guardr[j] & actr[j]) or ii) there is another currently active force statement that dominates (as represented by fdom[j,i]) or release statement that dominates (as represented by rdom[j,i]) the current force statement. The i^(th) control signal ctl[i] is set to 1 if the i^(th) force statement is enabled and active, i.e., (guardf[i] & actf(i)) holds true. Otherwise ctl[i] maintains its previous value.

In code 200 above, N and M represent the number of the force and release statements (both of which are equal to two in this example) on signal sig respectively; guardf and guardr are vectors of Boolean guards on individual force and release statements; actf and actr are the corresponding activity indicators for the force and release statements; ctl is the bit vector of multiplexer select signals shown in FIG. 1, prev_ctl is the corresponding bit vector indicating the active force statements set previously on sig, rdom[j,i] is the release dominance matrix and fdom[j,i] is the force dominance matrix.

It is understood that when force statements belong to different processes, their activation at the same time step yields nondeterministic results according to SystemVerilog semantics. To remedy this problem, the force dominance matrix is selected to represent specific conditions.

Force/Release Synthesis for Variables

A force statement applied to a variable overrides procedural and continuous assignments to the variable until a release statement is executed on the variable. When released, if the variable is not driven by a continuous assignment, it does not change its value immediately, but maintains its current value until the next procedural assignment to the variable is executed. Releasing a variable that is driven by a continuous assignment reestablishes that assignment.

In a well-formed RTL code, each variable is assigned in a single process (using an “always” procedure or a continuous assignment). Assigning a variable in several processes does not add further information. The description below is thus applied with reference to a well-formed RTL code. The release behavior on variables assigned in a continuous assignment is the same as the release behavior on nets described above.

Assume an “always” procedure with a sensitivity list, either implicit or explicit, that includes all types of RTL “always” procedures, such as “always_comb”, “always_latch”, “always_ff”, or “always @(*)”. As described above, it is assumed that the RTL code is represented in the canonical guarded form, so that the assignments to sig are guarded:

-   -   always @( . . . ) begin         -   . . .         -   if (guard) sig <=RHS;         -   . . .     -   end

In other words, if the condition “guard” is evaluated as true, the assignment of RHS to sig is executed. The procedure may contain any number of guarded assignments of sig, either in a blocking or non-blocking form, both of which are handled the same way. If there is a single assignment, then RHS corresponds to the “driver” signal shown in FIG. 1.

To satisfy the release semantics of variables assigned in a procedure, the output is latched when a release becomes active until an assignment to the variable gets executed. Therefore, when using a variable instead of a net, the logic circuit shown in FIG. 1 is augmented with a sustainer 120, as shown in FIG. 2. Intermediate signal val of FIG. 2 corresponds to the output signal sig of the circuit shown in FIG. 1. The output signal sig of sustainer 120 is the signal that receives the RHS value in accordance with the code above.

FIG. 2 is a schematic block diagram of a logic circuit 150 synthesized in response to code 200 above when sig is a variable. Logic circuit 150 is similar to logic circuit 100 shown in FIG. 1 except that logic circuit 150 also includes a sustainer 120, as described above.

The sustainer maintains information about a previously executed assignment to sig. The description of the sustainer below is made with reference to a condition when the assignment statement(s) belong to a different procedure than the force and release statements. In a general case however, one or more dominance matrices, similar to those described above, is developed between force, release and assignment statements that govern the state transition diagram shown in FIG. 3. A signal, referred to hereinafter as ev, and associated with a variable, is set if and only if the procedure to which the assignment statement containing the variable is active, as described above, and the variable's associated guard is true.

In one embodiment, sustainer 120 is implemented as a finite state machine having three states, namely NORMAL, FORCED and RELEASED, as shown in FIG. 3. Sustainer 120 is configured to operate in the NORMAL state when there are no force and/or release statements. The NORMAL state is the initial state and is activated anew when no force is active and there is no after-effect of the force until the first active assignment. Sustainer 120 is configured to operate in the FORCED state when one of the force statements is active. Sustainer 120 is configured to operate in the RELEASED state when the signal has been released from a force statement; however, its previous value is sustained until the next assignment.

Referring to FIG. 3, a transition from NORMAL to FORCED state occurs if one of the force statements is active (i.e., ctl !=0). A transition from FORCED to NORMAL state occurs if all force statements are deactivated (“ctl==0” or “!ctl” is 1'b1), and the assignment to ev is active. A transition from FORCED to RELEASED state occurs if all the force statements are deactivated, and the assignment to ev is inactive (!ev=1'b1). A transition from RELEASED to FORCE occurs when a force statement is activated (ctl==1). A transition from RELEASED to NORMAL occurs when all the force statements are deactivated (ctl==0) and the assignment to ev is active.

FIG. 4 is a simplified high-level logic block diagram 200 showing finite state machine (FSM) block 200 that receives input signals ev, ctl[1:0] and the global clock signal $global_clock, and in response generates the states as described above with reference to FIG. 3. As is also seen from FIG. 3, signal ev is generated by a logical AND operation of signals act and guard. As was described above with reference to FIG. 3, signal state may be set to any of the states NORMAL, FORCED and RELEASED.

FIG. 5 shows the output part of sustainer 120 shown in FIG. 2. Sustainer 120 is shown as including logic OR gate 302, multiplexer 304 and flip-flop 306. If the output signal state of FSM 200 is not in the NORMAL state or any bit of signal ctl is equal to 1, as shown in FIG. 5, then the select signal C of multiplexer 304 causes signal val (present at input terminal S₁ of multiplexer 304) to be delivered as signal sig to output terminal D of multiplexer 304. At the next transition of clock signal $global_clock, signal sig is delivered to output terminal Q of flip-flop 306, which is coupled to input terminal S₂ of multiplexer 304. As long as FSM 200 is in the state NORMAL and all bits of signal ctl are equal to 0, signal sig (present at input terminal S₂ of multiplexer 304 as signal sustained_sig) maintains its previous value. Therefore, the value stored in flip-flop 306 is used when no force is currently active, but was active in the past and then released, and no new assignment to sig has been made. The code below describes the operation of sustainer 120 shown in FIG. 5:

-   -   always @global_clock sustained_sig <=sig;     -   assign sig=(state==NORMAL∥ctl) ? val: sustained_sig;

The SystemVerilog release semantics is simulation-oriented and does not always have a clear physical meaning. For example, if signal sig is an output signal of some combinational logic, its release behavior depends on its assignment implementation. If signal sig is assigned by a continuous assignment, it is released immediately. But if signal sig is assigned in an always_comb procedure, its value is preserved until the next assignment takes place. Therefore, unless the congruency mode is required, where the emulation or the formal verification behavior follow the simulation semantics, a simpler solution for continuous assignment may be used for assignments, as described above.

Force in Initial Procedure

As described above, an initial procedure may be reduced to an always procedure controlled by a special clock transitioning only once. However, when signal sig is unconditionally forced in an initial procedure, and not released, as shown in the code below:

-   -   initial begin         -   . . .         -   a= . . . sig . . . ;         -   . . .         -   force sig=value;         -   . . .     -   end         then all occurrences of signal sig on the right hand-side may be         substituted with a value “value”, except for the occurrences in         the same procedure preceding the force statement—as shown on the         right hand-side of the assignment to “a” in the above example.         The same optimization, with minor modifications, may be applied         when the same signal is unconditionally forced in several         initial procedures and/or multiple times in the same initial         procedure.

DETAILED DESCRIPTION—TECHNOLOGY SUPPORT GENERAL COMPUTER EXPLANATION

FIGS. 6A, 6B and 6C are simplified block diagrams of a computer system suitable for use with embodiments of the technology, as well as circuit design and circuit embodiments of the technology.

In FIG. 6A, computer system 3110 typically includes at least one computer or processor 3114 which communicates with a number of peripheral devices via bus subsystem 3112. Typically, the computer can include, or the processor can be, any of a microprocessor, graphics processing unit, or digital signal processor, and their electronic processing equivalents, such as an Application Specific Integrated Circuit (ASIC) or Field Programmable Gate Array (FPGA). The terms ‘processor’ and ‘computer’ are further defined below. These peripheral devices may include a storage subsystem 3124, comprising a memory subsystem 3126 and a file storage subsystem 3128, user interface input devices 3122, user interface output devices 3120, and a network interface subsystem 3116. The input and output devices allow user interaction with computer system 3110.

The computer system may be a server computer, a client computer, a workstation, a mainframe, a personal computer (PC), a tablet PC, a set-top box (STB), a personal digital assistant (PDA), a cellular telephone, a smartphone, a web appliance, a rack-mounted “blade”, a kiosk, a television, a game station, a network router, switch or bridge, or any data processing machine capable of executing instructions 124 (sequential or otherwise) that specify actions to be taken by that machine.

The computer system typically includes an operating system, such as Microsoft's Windows, Sun Microsystems's Solaris, Apple Computer's MacOs, Linux or Unix. The computer system also typically can include a Basic Input/Output System (BIOS) and processor firmware. The operating system, BIOS and firmware are used by the processor to control subsystems and interfaces connected to the processor. Typical processors compatible with these operating systems include the Pentium and Itanium from Intel, the Opteron and Athlon from Advanced Micro Devices, and the ARM processor from ARM Holdings.

Innovations, embodiments and/or examples of the claimed inventions are neither limited to conventional computer applications nor the programmable apparatus that run them. For example, the innovations, embodiments and/or examples of what is claimed can include an optical computer, quantum computer, analog computer, or the like. The computer system may be a multi-processor or multi-core system and may use or be implemented in a distributed or remote system. The term ‘processor’ here is used in the broadest sense to include a singular processor and multi-core or multi-processor arrays, including graphic processing units, digital signal processors, digital processors and combinations of these devices. Further, while only a single computer system or a single machine may be illustrated, the use of a singular form of such terms shall also signify any collection of computer systems or machines that individually or jointly execute instructions 124 to perform any one or more of the sets of instructions discussed herein. Due to the ever-changing nature of computers and networks, the description of computer system 3110 depicted in FIG. 6A is intended only as one example for purposes of illustrating the preferred embodiments. Many other configurations of computer system 3110 are possible having more or less components than the computer system depicted in FIG. 6A.

Network interface subsystem 3116 provides an interface to outside networks, including an interface to communication network 3118, and is coupled via communication network 3118 to corresponding interface devices in other computer systems or machines. Communication network 3118 may comprise many interconnected computer systems, machines and communication links. These communication links may be wireline links, optical links, wireless links, or any other devices for communication of information. Communication network 3118 can be any suitable computer network, for example a wide area network such as the Internet, and/or a local area network such as Ethernet. The communication network can be wired and/or wireless, and the communication network can use encryption and decryption methods, such as is available with a virtual private network. The communication network uses one or more communications interfaces, which can receive data from, and transmit data to, other systems. Embodiments of communications interfaces typically include an Ethernet card, a modem (e.g., telephone, satellite, cable, or ISDN), (asynchronous) digital subscriber line (DSL) unit, Firewire interface, USB interface, and the like. One or more communications protocols can be used, such as HTTP, TCP/IP, RTP/RTSP, IPX and/or UDP.

User interface input devices 3122 may include an alphanumeric keyboard, a keypad, pointing devices such as a mouse, trackball, touchpad, stylus, or graphics tablet, a scanner, a touchscreen incorporated into the display, audio input devices such as voice recognition systems or microphones, eye-gaze recognition, brainwave pattern recognition, and other types of input devices. Such devices can be connected by wire or wirelessly to a computer system. In general, use of the term “input device” is intended to include all possible types of devices and ways to input information into computer system 3110 or onto communication network 3118. User interface input devices typically allow a user to select objects, icons, text and the like that appear on some types of user interface output devices, for example, a display subsystem.

User interface output devices 3120 may include a display subsystem, a printer, a fax machine, or non-visual displays such as audio output devices. The display subsystem may include a cathode ray tube (CRT), a flat-panel device such as a liquid crystal display (LCD), a projection device, or some other device for creating a visible image such as a virtual reality system. The display subsystem may also provide non-visual display such as via audio output or tactile output (e.g., vibrations) devices. In general, use of the term “output device” is intended to include all possible types of devices and ways to output information from computer system 3110 to the user or to another machine or computer system.

Memory subsystem 3126 typically includes a number of memories including a main random-access memory (RAM) 3130 (or other volatile storage device) for storage of instructions and data during program execution and a read only memory (ROM) 3132 in which fixed instructions are stored. File storage subsystem 3128 provides persistent storage for program and data files, and may include a hard disk drive, a floppy disk drive along with associated removable media, a CD-ROM drive, an optical drive, a flash memory, or removable media cartridges. The databases and modules implementing the functionality of certain embodiments may be stored by file storage subsystem 3128.

Bus subsystem 3112 provides a device for letting the various components and subsystems of computer system 3110 communicate with each other as intended. Although bus subsystem 3112 is shown schematically as a single bus, alternative embodiments of the bus subsystem may use multiple busses. For example, RAM-based main memory can communicate directly with file storage systems using Direct Memory Access (DMA) systems.

FIG. 6B depicts a memory 3140 such as a non-transitory, computer readable data and information storage medium associated with file storage subsystem 3128, and/or with network interface subsystem 3116, and can include a data structure specifying a circuit design. The memory 3140 can be a hard disk, a floppy disk, a CD-ROM, an optical medium, removable media cartridge, or other medium that stores computer readable data in a volatile or non-volatile form. Software read into a computer from such a memory can be converted at a selected instance in time from a tangible form to a transmission signal that is propagated through a medium (such as a network, connector, wire, or trace as an electrical pulse or a medium such as space or an atmosphere as electromagnetic radiation with wavelengths in the electromagnetic spectrum longer than infrared light).

FIG. 6C signifies an integrated circuit 3190 created with the described technology that includes one or more cells selected, for example, from a cell library.

DETAILED DESCRIPTION—TECHNOLOGY SUPPORT HARDWARE/SOFTWARE EQUIVALENCE

Some of the innovations, embodiments and/or examples described herein comprise and/or use a processor. As used herein, the term ‘processor’ signifies a tangible data and information processing device that physically transforms data and information, typically using a sequence transformations (also referred to as ‘operations’). Data and information can be physically represented by an electrical, magnetic, optical or acoustical signal that is capable of being stored, accessed, transferred, combined, compared, or otherwise manipulated by the processor. The term “processor” can signify a singular processor and multi-core systems or multi-processor arrays, including graphic processing units, digital signal processors, digital processors or combinations of these elements.

The processor can be electronic, for example, comprising digital logic circuitry (for example, binary logic), or analog (for example, an operational amplifier). The processor can also be non-electronic, for example, as seen in processors based on optical signal processing, DNA transformations or quantum mechanics, or a combination of technologies, such as an optoelectronic processor. For data and information structured in binary form, any processor that can transform the data and information using the AND, OR and NOT logical operations (and their derivatives, such as the NAND, NOR, and XOR operations) can transform the data and information using any function of Boolean logic. A processor such as an analog neural network processor can also transform data and information non-digitally. There is no scientific evidence that any of these processors are processing, storing and retrieving data and information, in any manner or form equivalent to the bioelectric structure of the human brain.

The one or more processors may also operate to support performance of the relevant operations in a ‘cloud computing’ environment or as a ‘software as a service’ (SaaS). For example, at least some of the operations may be performed by a group of processors available at a distributed or remote system, these processors accessible via a communications network (e.g., the Internet) and via one or more software interfaces (e.g., an application program interface (API).)

As used herein, the term ‘module’ signifies a tangible data and information processing device, that typically is limited in size and/or complexity. For example, the term ‘module’ can signify one or more methods or procedures that can transform data and information. The term ‘module’ can also signify a combination of one or more methods and procedures in a computer program. The term ‘module’ can also signify a small network of digital logic devices, in which interconnections of the logic devices give structure to the network. Methods and procedures comprising a module, specified in a specialized language, such as System C, can be used to generate a specification for a network of digital logic devices that process data and information with exactly the same results as are obtained from the methods and procedures.

A module can be permanently configured (e.g., hardwired to form hardware), temporarily configured (e.g., programmed with software), or a combination of the two configurations (for example, a structured ASIC). Permanently configured modules can be manufactured, for example, using Application Specific Integrated Circuits (ASICs) such as Arithmetic Logic Units (ALUs), Programmable Logic Arrays (PLAs), or Read Only Memories (ROMs), all of which are typically configured during manufacturing. Temporarily configured modules can be manufactured, for example, using Field Programmable Gate Arrays (FPGAs—for example, sold by Xilink or Intel's Altera), Random Access Memories (RAMs) or microprocessors. A module is configured to process data and information, typically using a sequence transformations (also referred to as ‘operations’) applied to the data and information (or in the case of ROMs and RAMS, transforming data and information by using the input information as an address for memory that stores output data and information), to perform aspects of the present innovations, embodiments and/or examples of the invention.

Modules that are temporarily configured need not be configured at any one instance in time. For example, a processor comprising one or more modules can have the modules configured at different times. The processor can comprise a set of one or more modules at one instance of time, and to comprise a different set of one or modules at a different instance of time. The decision to manufacture or implement a module in a permanently configured form, a temporarily configured form, or a combination of the two forms, may be driven by cost, time considerations, engineering constraints and/or specific design goals. The “substance” of a module's processing is independent of the form in which it is manufactured or implemented.

As used herein, the term ‘algorithm’ signifies a process comprising a sequence or set of operations or instructions that a module can use to transform data and information to achieve a result. A module can comprise one or more algorithms. As used herein, the term ‘thread’ refers to a sequence of instructions that can comprise a subset of the instructions of an entire process or algorithm. A process or algorithm can be partitioned into multiple threads that can be executed in parallel.

As used herein, the term ‘computer’ includes at least one information processor that, for example, can perform certain operations such as (but not limited to) the AND, OR and NOT logical operations using electronic gates that can comprise transistors, with the addition of memory (for example, memory based on flip-flops using the NOT-AND or NOT-OR operation). Such a processor is said to be Turing-complete or computationally universal. A computer, whether or not it is a digital computer, typically comprises many modules.

As used herein, the term ‘software’ or ‘program’ signifies one or more algorithms and data structures that configure a processor for use in the innovations, embodiments and examples described in this specification. Such devices configurable by software include one or more computers, for example, standalone, client or server computers, or one or more hardware modules, or systems of one or more such computers or modules. As used herein, the term “software application” signifies a set of data and instructions that configure the processor to achieve a specific result, for example, to perform word processing operations, or to encrypt a set of data.

As used herein, the term ‘programming language’ signifies a grammar and syntax for specifying sets of instruction and data that comprise software. Programming languages include assembler instructions, instruction—set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more higher level languages, such as conventional procedural programming languages, for example, the “C” programming language or similar programming languages (such as SystemC), or object oriented programming language such as Smalltalk, C++ or the like, and any future equivalent programming languages.

Software is entered into, equivalently, read into, one or memories of the computer or computer system from a data and information storage device. The computer typically has a device for reading storage media that is used to transport the software or has an interface device that receives the software over a network. This process is discussed in the General Computer Explanation section.

DETAILED DESCRIPTION—TECHNOLOGY SUPPORT EDA SYSTEM/WORKFLOW EXPLANATION

FIG. 7 illustrates various processes performed in the design, verification and fabrication of an item of manufacture such as an integrated circuit using software tools with a computer, and possibly special hardware-assisted tools, to transform and verify design data and instructions that represent the integrated circuit. These processes start with the generation of a product idea 3010 with information supplied by a designer, information which is transformed during a process to create an item of manufacture (referred to herein as a design or device) that uses an EDA software tool 3012, which may also be signified herein as EDA software, as a design tool, or a verification tool. When the design is finalized, it can be taped-out 3034, which typically is when artwork (e.g., geometric patterns) for the integrated circuit is sent to a fabrication facility to manufacture the mask set, which is then used to manufacture the integrated circuit. After tape-out, a semiconductor die is fabricated 3036 and packaging and assembly processes 3018 are performed, which result in the finished integrated circuit 3020 which may also be signified herein as a circuit, device, component, chip or SoC (System on Chip).

Items of manufacture, for example, a circuit or system are used in commerce at a variety of levels of abstraction ranging from low-level transistor layouts to high-level description languages. Most designers start at high-level of abstraction to design their circuits and systems, using a hardware description language (HDL) such as VHDL, Verilog, SystemVerilog, SystemC, MyHDL or OpenVera. The high-level HDL is easier for developers to comprehend, especially for a vast system, and may describe highly complex concepts that are difficult to grasp using a lower level of abstraction. The HDL description may be converted into other levels of abstraction as is helpful to the developers. For example, a high-level description may be converted to a logic-level register transfer level (RTL) description, a gate-level (GL) description, a layout-level description, or a mask-level description. Each lower abstraction level introduces more detail into the design description. The lower-levels of abstraction may be generated automatically by computer, derived from a design library, or created by another design automation technique. An example of a specification language at a lower level of abstraction is SPICE, much used detailed descriptions of analog-based circuits.

A design process that uses an EDA software tool 3012 includes processes 3050-3068, which are described below. This design flow description is for illustration purposes only and is not meant to limit the present disclosure. For example, an actual integrated circuit design may require a designer to perform the design operations in a different sequence than the sequence described herein.

During system design 3050, a designer describes the functionality to be manufactured. The designer can also perform what-if planning to refine the functionality and to check costs, etc. Hardware-software architecture partitioning can occur at this stage. Exemplary EDA software products from Synopsys, Inc. of Mountain View, Calif., that can be used at this stage include: Model Architect, Saber, System Studio, and Designware products.

During logic design and functional verification 3052, modules in the circuit are specified in one or more hardware description languages, or HDLs, and the design in HDL is checked for functional accuracy, that is, to match the requirements of the specification of the circuit or system being designed to ensure that the design produces the correct outputs. Exemplary HDL languages are Verilog, VHDL and SystemC. Functional verification is typically done by using software-based simulators and other tools such as testbench generators, static HDL checking tools and formal verification tools. In some situations, special hardware referred to as ‘emulators’ or ‘prototyping systems’ are used to speed up the functional verification. Exemplary EDA software products from Synopsys, Inc. of Mountain View, Calif. that can be used at this stage include: VCS, Vera, Designware, Magellan, Formality, ESP and Leda products. Exemplary emulator and prototyping products also available from Synopsys that can be used at this state include: Zebu® and Protolink® (®=“Registered Trademark”).

During synthesis and design for test 3054, HDL code is translated to a netlist. This netlist can be optimized for the target technology. Additionally, tests can be designed and implemented to check the finished integrated circuit. Exemplary EDA software products from Synopsys, Inc. of Mountain View, Calif. that can be used at this stage include: Design Compiler, Physical Compiler, Test Compiler, Power Compiler, FPGA Compiler, Tetramax, and Designware products.

During netlist verification 3056, the netlist is checked for compliance with timing constraints and for correspondence with the HDL code. Exemplary EDA software products from Synopsys, Inc. of Mountain View, Calif. that can be used at this stage include: Formality, Primetime, and VCS products.

During design planning 3058, an overall floor plan for the integrated circuit is constructed and analyzed for timing and top-level routing. Exemplary EDA software products from Synopsys, Inc. of Mountain View, Calif. that can be used at this stage include: Astro and IC Compiler products.

During layout implementation 3060, the physical placement (positioning of circuit elements such as transistors or capacitors) and routing (connection of the same by a plurality of conductors) occurs, as can selection of library cells to perform specific logic functions. Exemplary EDA software products from Synopsys, Inc. of Mountain View, Calif. that can be used at this stage include: the Astro and IC Compiler products.

During analysis and extraction 3062, the circuit function is verified at the layout level, which permits refinement of the layout design. Exemplary EDA software products from Synopsys, Inc. of Mountain View, Calif. that can be used at this stage include: Astrorail, Primerail, Primetime, and Star RC/XT products.

During physical verification 3064, the layout design is checked to ensure correctness for manufacturing constraints such as DRC constraints, electrical constraints, lithographic constraints, and circuitry function matching the HDL design specification. Exemplary EDA software products from Synopsys, Inc. of Mountain View, Calif. that can be used at this stage include the Hercules product.

During resolution enhancement 3066, geometric manipulations of the layout are performed to improve manufacturability of the design. Exemplary EDA software products from Synopsys, Inc. of Mountain View, Calif. that can be used at this stage include: Proteus products.

During tape-out, data is created to be used (after lithographic enhancements are applied if appropriate) for production of lithography masks. Example EDA software products from Synopsys, Inc., that can be used during tape-out include the IC Compiler and Custom Designer families of products.

During mask-data preparation 3068, the ‘tape-out’ data is used to produce lithography masks that are used to produce finished integrated circuits. Exemplary EDA software products from Synopsys, Inc. of Mountain View, Calif. that can be used at this stage include the CATS family of products.

For all of the above mentioned integrated circuit design tools, similar tools from other EDA vendors, such as Cadence, Siemens, other corporate entities or various non-commercial tools from universities, or open source repositories, can be used as an alternative.

Embodiments of the present disclosure can be used during one or more of the above-described stages. Specifically, some embodiments of the present disclosure can be used in EDA software 3012.

A storage subsystem is preferably used to store the programs and data structures that provide the functionality of some or all of the EDA tools described herein, and tools applied for development of cells for the library and for physical and logical design using the library. These programs and data structures are generally executed by one or more processors in a manner known to those of ordinary skill in the art.

DETAILED DESCRIPTION—TECHNOLOGY SUPPORT EMULATION ENVIRONMENT EXPLANATION

An EDA software system, such as element 3012 depicted in FIG. 7, typically includes an emulation system 3054 to verify the functionality of the circuit design. FIG. 8 depicts a typical emulation system which includes a host computer system 3300 (often part of an EDA system) and an emulator system 3202 (typically a set of programmable devices such as Field Programmable Gate Arrays (FPGAs)). The host system generates data and information, typically using a compiler 3210, to configure the emulator to emulate a circuit design. One of more circuit designs to be emulated are referred to as a DUT (Design Under Test). The emulator is a hardware system that emulates a DUT, for example, to use the emulation results for verifying the functionality of the DUT. One example of an emulation system that can be used for the embodiments disclosed herein is the ZeBu Server available from Synopsys, Inc.

The host system 3300 comprises one or more processors. In the embodiment where the host system is comprised of multiple processors, the functions described herein as being performed by the host system may be distributed among the multiple processors.

The host system 3300 typically includes a compiler 3210 that processes code written in a hardware description language that represents a DUT, producing data (typically binary) and information that is used to configure the emulation system 3202 to emulate the DUT. The compiler 3210 may transform, change, reconfigure, add new functions to, and/or control the timing of the DUT.

The host system and emulator exchange data and information using signals carried by an emulation connection. The connection can be one or more electrical cables, for example, cables with pin configurations compatible with the RS232 or USB protocols. The connection can be a wired communication medium or network, such as a local area network, or a wide area network such as the Internet. The connection can be a wireless communication medium or a network with one or more points of access, using a wireless protocol such as Bluetooth® or IEEE 802.11. The host system and emulator can exchange data and information through a third device, such as a network server.

The emulator includes multiple FPGAs (or other programmable devices), for example, elements 3204 ₁ to 304 _(N) in FIG. 8. Each FPGA can include one or more FPGA interfaces through which the FPGA is connected to other FPGAs of the emulator (and potentially other emulator hardware components), in order for the FPGAs to exchange signals. An FPGA interface may also be referred to as an input/output pin or an FPGA pad. While some embodiments disclosed herein make use of emulators comprising FPGAs, other embodiments can include other types of logic blocks instead of, or along with, the FPGAs for emulating DUTs, for example, custom FPGAs, specialized ASICs for emulation or prototyping, memories, and input/output devices.

A programmable device may include an array of programmable logic blocks and a hierarchy of reconfigurable interconnects that allow the programmable logic blocks to be connected to each other according to the descriptions in the HDL code. Each of the programmable logic blocks can be configured to perform complex combinational functions, or merely simple logic gates, such as AND, and XOR logic blocks.

In many FPGAs, logic blocks also include memory elements, which may be simple latches, flip-flops or more complex blocks of memory. Depending on the length of the interconnections between different logic blocks, signals may arrive at input terminals of the logic blocks at different times.

Programmable processors 3204 ₁-3204 _(N) may be placed into one or more hardware boards 3212 ₁ through 3212 _(M). Many of such boards may be placed into a hardware unit, e.g. 3214 ₁. The boards within a unit may be connected using the backplane of the unit or any other types of connections. In addition, multiple hardware units (e.g., 3214 ₁ through 3214 _(K)) may be connected to each other by cables or any other means to form a multi-unit system. In general, the hardware emulation or prototype system 3202 may be formed using a single board, a single unit with multiple boards, or with multiple units without departing from the teachings of the present disclosure.

For a DUT that is to be emulated, the emulator receives from the host system one or more bit files including a description of the DUT. The bit files further specify partitions of the DUT created by the host system with trace and injection logic, mappings of the partitions to the FPGAs of the emulator, and design constraints. Based on the bit files, the emulator configures the FPGAs to perform the functions of the DUT. With some emulators, one or more FPGAs of an emulator already have the trace and injection logic built into the silicon of the FPGA. For this type of emulator, the FPGAs don't have to be configured by the host system to emulate trace and injection logic.

The host system 3110 receives (e.g., from a user) a description of a DUT that is to be emulated. In one embodiment, the DUT description is in a hardware description language (HDL), such as register transfer language (RTL). In another embodiment, the DUT description is in netlist level files, or a mix of netlist level files and HDL files. If part of the DUT description or the entire DUT description is in a HDL, the host system synthesizes the DUT description to create a gate level netlist based on the DUT description. A host system can use the netlist of the DUT to partition the DUT into multiple partitions, with some of these partitions including trace and injection logic. The trace and injection logic traces interface signals exchanged via the interfaces of an FPGA. Additionally, the trace and injection logic can be used to inject traced interface signals into the logic of the FPGA. The host system maps each partition to an FPGA of the emulator. With some emulators, the trace and injection logic is only included in select partitions for a group of FPGAs. The trace and injection logic can be built into one or more of the FPGAs of an emulator. The host system can synthesize multiplexers to be mapped into the FPGAs. The multiplexers can be used by the trace and injection logic to inject interface signals into the DUT logic.

The host system creates bit files describing each partition of the DUT and the mapping of the partitions to the FPGAs. For partitions in which trace and injection logic was incorporated, the bit files also describe the incorporation of the logic. The bit files may also include place and route information and design constraints. The host system stores the bit files and also stores for components of the DUT information describing which FPGAs are to emulate each component of the DUT (to which FPGAs each component is mapped).

Upon request, the host system transmits the bit files to the emulator. The host system instructs the emulator to emulate the DUT. During emulation of the DUT or at the end of the emulation, the host system receives emulation results from the emulator through the emulation connection. Emulation results are data and information generated by the emulator based on the emulation of the DUT. The emulation results include interface signals (states of interface signals) traced by the trace and injection logic of each FPGA. The host system can stores the emulation results, or transmit them to another processing system.

After emulation of the DUT, a user may request to debug a component of the DUT. If such a request is made the user may provide a time period of the emulation to debug. The host system identifies which FPGAs are configured to emulate the component based on the stored information. The host system retrieves stored interface signals associated with the time period and traced by the trace and injection logic of each identified FPGA. The host system instructs the emulator to re-emulate the identified FPGAs, either one by one, multiple at a time, or altogether. The host system transmits the retrieved interface signals to the emulator in order to re-emulate the component for the time period. The trace and injection logic of each identified FPGA injects its respective interface signals received from the host system into the logic of the DUT mapped to the FPGA. In case of multiple re-emulations of an FPGA, the results may be merged all together to have a full debug view.

The host system receives from the emulator signals traced by logic of the identified FPGAs during the re-emulation of the component. The host system stores the signals received from the emulator. The signals traced during the re-emulation can have a higher sampling rate than during the initial emulation. For example, in the initial run a traced signal may be comprised of a saved hardware state every X milliseconds. However, in the re-emulation the traced signal may be comprised of a saved hardware state every Y milliseconds, where Y is less than X. If the user requests to view a waveform of a signal traced during the re-emulation, the host system can retrieve the stored signal and display a plot of the signal (generates a waveform of the signal). Afterwards the user can, for example, request to re-emulate the same component but for a different time period or to re-emulate another component.

A host system typically comprises at least seven sub-systems: a design synthesizer, a mapping module, a run time module, a results module, a debug module, a waveform module, and a storage module. Each of these sub-systems may be embodied as hardware, software, firmware, or a combination thereof. Together these components configure the emulator, and monitor the emulation results.

The design synthesizer converts the HDL of a DUT into gate level logic. For a DUT that is to be emulated, the design synthesizer receives a description of the DUT. If the description of the DUT is fully or partially in HDL (e.g., RTL or other level of abstraction), the design synthesizer 3210 synthesizes the HDL of the DUT to create a gate-level netlist with a description of the DUT in terms of gate level logic.

The mapping module partitions DUTs and maps partitions to emulator FPGAs. The mapping module partitions a DUT at the gate level into a number of partitions using the netlist of the DUT. For each partition, the mapping module retrieves a gate level description of the trace and injection logic and incorporates the logic into the partition. As described above, the trace and injection logic included in a partition is configured to trace signals exchanged via the interfaces of an FPGA to which the partition is mapped (trace interface signals). The trace and injection logic can be incorporated into the DUT prior to the partitioning. For example, the trace and injection logic may be incorporated by the design synthesizer prior to or after the synthesizing the HDL of the DUT. Hence, the trace and injection logic may not match the partitions, it may be a subset, a superset or even different from the partitions.

In addition to including the trace and injection logic, the mapping module may include additional tracing logic in a partition in order to trace the states of certain DUT components that are not traced by the trace and injection logic (to trace signals other than the interface signals traced by the trace and injection logic). The mapping module may include the additional tracing logic in the DUT prior to the partitioning or in partitions after the partitioning. The design synthesizer can include the additional tracing logic in an HDL description of the DUT prior to synthesizing the description.

The mapping module maps each partition of the DUT to an FPGA of the emulator. The mapping module performs the partitioning and mapping using design rules, design constraints (e.g., timing or logic constraints), and information about the emulator. For components of the DUT, the mapping module stores information in the storage module describing which FPGAs are to emulate each component.

Based on the partitioning and the mapping, the mapping module generates one or more bit files that describe the created partitions and the mapping of logic to each FPGA of the emulator. The bit files may include additional information, such as constraints of the DUT, and routing information of connections between FPGAs and connections within each FPGA. The mapping module can generate a bit file for each partition of the DUT, which can be stored in the storage module. Upon request from a user, the mapping module transmits the bit files to the emulator, which the emulator uses to configure the FPGAs to emulate the DUT.

If the emulator includes specialized ASICs that include the trace and injection logic, the mapping module may generate a specific configuration allowing to connect them to the DUT or just save the information of what traced/injected signal is and where the information is stored on the specialized ASIC.

The run time module controls emulations performed on the emulator. The run time module may cause the emulator to start or stop executing an emulation. Additionally, the run time module may provide input signals/data to the emulator. The input signals may be provided directly to the emulator through the connection or indirectly through other input signal devices. For example, the host system with the run time module may control an input signal device to provide the input signals to the emulator. The input signal device may be, for example, a test board (directly or through cables), signal generator, another emulator, or another host system.

The results module processes emulation results generated by the emulator. During emulation and/or after completing the emulation, the results module receives emulation results from the emulator generated during the emulation. The emulation results include signals traced during the emulation. Specifically, the emulation results include interface signals traced by the trace and injection logic emulated by each FPGA. The emulation results may also include signals traced by additional logic included in the DUT. Each traced signal can span multiple cycles of the emulation. A traced signal is comprised of multiple hardware states and each hardware state is associated with a time of the emulation. The results module stores the traced signals received in the storage module. For each stored signal, the results module can store information indicating which FPGA generated the traced signal.

The debug module allows users to debug DUT components. After the emulator has emulated a DUT and the results module has received the interface signals traced by the trace and injection logic during the emulation, a user may request to debug a component of the DUT by re-emulating the component for a specific time period. In a request to debug a component, the user identifies the component and indicates a time period of the emulation to debug. The user's request can also include a sampling rate that indicates how often hardware states should be saved by logic that traces signals.

The debug module identifies the one or more FPGAs of the emulator that are configured to emulate the component based on the information stored by the mapping module in the storage module. For each identified FPGA, the debug module retrieves, from the storage module, interface signals traced by the trace and injection logic of the FPGA during the time period indicated by the user (i.e., retrieve hardware states traced by the trace and injection logic that are associated with the time period).

The debug module transmits the retrieved interface signals to the emulator. The debug module instructs the debug module to run the identified FPGAs and for the trace and injection logic of each identified FPGA to inject its respective traced signals into logic of the FPGA in order to re-emulate the component for the requested time period. The debug module can also transmit the sampling rate provided by the user to the emulator so that the tracing logic traces hardware states at the proper intervals.

To debug the component, the emulator only has to run the FPGAs to which the component has been mapped. Additionally, the re-emulation of the component does not have to start from the beginning, but can start at any point desired by the user.

For an identified FPGA, the debug module can transmit instructions to the emulator to load multiple emulator FPGAs with the same configuration of the identified FPGA. The debug module additionally instructs the emulator to run the multiple FPGAs in parallel. Each FPGA from the multiple FPGAs is run with a different time window of the interface signals in order to generate a larger time window in a shorter amount of time. For example, for the identified FPGA to run a certain amount of cycles it may take an hour. However, if multiple FPGAs are loaded with the configuration of the identified FPGA and each of the FPGAs runs a subset of the cycles, it may only take a few minutes for the FPGAs to collectively run all of the cycles.

A user may identify a hierarchy or a list of DUT signals to re-emulate. To enable this, the debug module determines the FPGA needed to emulate the hierarchy or list of signals, retrieves the necessary interface signals and transmits the retrieved interface signals to the emulator for re-emulation. Hence, a user can identify any element (e.g., component or signal) of the DUT to debug/re-emulate.

The waveform module generates waveforms based on traced signals. If a user requests to view a waveform of a signal traced during an emulation run, the host system retrieves the signal from the storage module. The waveform module displays a plot of the signal to the user. For one or more signals, when the signals are received from the emulator, the waveform module can automatically generate the plots of the signals.

DETAILED DESCRIPTION—SEMANTIC SUPPORT

The signifier ‘commercial solution’ signifies, solely for the following paragraph, an engineering domain-specific (and thus non-preemptive—see Bilski) electronic structure, process for specified machines, manufacturable circuit (and their Church-Turing equivalents) or composition of matter that is useful in commerce to solve a problem of technology, that is, a use in commerce of an application of science or use in commerce of technology.

The signifier ‘abstract’ (when used in a patent claim for any embodiments disclosed herein for a new commercial solution that is a scientific application of one or more laws of nature {see Benson}, and that solves a problem of technology {see Diehr} used in commerce—or improves upon an existing commercial solution {see Diehrj}—is precisely defined by the inventor(s) {see MPEP 2111.01} as follows:

a) a new commercial solution is ‘abstract’ if it is not novel (e.g., it is so well known in equal prior art {see Alice} and/or the use of equivalent prior art solutions is long prevalent {see Bilski} in science, engineering or commerce), and thus unpatentable under 35 U.S.C. 102, for example, because it is “difficult to understand” {see Merriam-Webster definition for ‘abstract’} how the commercial solution differs from equivalent prior art solutions; or

b) a new commercial solution is ‘abstract’ if it is obvious, that is, if the existing prior art includes at least one analogous prior art solution {see KSR}, or the existing prior art includes at least two prior art items that can be combined {see Alice} by a person having ordinary skill in the art {a “PHOSITA”, see MPEP 2141-2144} to be equivalent to the new commercial solution, and is thus unpatentable under 35 U.S.C. 103, for example, because it is “difficult to understand” how the new commercial solution differs from a PHOSITA-combination/-application of the existing prior art; or

c) a new commercial solution is ‘abstract’ if it is not disclosed with an enabling description either because there is insufficient guidance in the enabling description, or because only a generic implementation is described {see Mayo} with unspecified elements, parameters or functionality, so that a PHOSITA is unable to instantiate a useful embodiment of the new commercial solution, without, for example, requiring special programming {see Katz} or circuit design to be performed by the PHOSITA), and is thus unpatentable under 35 U.S.C. 112, for example, because it is “difficult to understand” how to use in commerce any embodiment of the new commercial solution.

DETAILED DESCRIPTION—CONCLUSION

The foregoing Detailed Description signifies in isolation the individual features, structures, functions, or characteristics described herein and any combination of two or more such features, structures, functions or characteristics, to the extent that such features, structures, functions or characteristics or combinations thereof are based on the present specification as a whole in light of the knowledge of a person skilled in the art, irrespective of whether such features, structures, functions or characteristics, or combinations thereof solve any problems disclosed herein, and without limitation to the scope of the claims. When an embodiment of a claimed invention comprises a particular feature, structure, function or characteristic, it is within the knowledge of a person skilled in the art to use such feature, structure, function, or characteristic in connection with other embodiments whether or not explicitly described, for example, as a substitute for another feature, structure, function or characteristic.

In view of the foregoing Detailed Description it will be evident to a person skilled in the art that many variations may be made within the scope of innovations, embodiments and/or examples, such as function and arrangement of elements, described herein without departing from the principles described herein. One or more elements of an embodiment may be substituted for one or more elements in another embodiment, as will be apparent to those skilled in the art. The embodiments described herein are chosen to signify the principles of the invention and its useful application, thereby enabling others skilled in the art to understand how various embodiments and variations are suited to the particular uses signified.

The foregoing Detailed Description of innovations, embodiments, and/or examples of the claimed inventions has been provided for the purposes of illustration and description. It is not intended to be exhaustive nor to limit the claimed inventions to the precise forms described but is to be accorded the widest scope consistent with the principles and features disclosed herein. Obviously, many variations will be recognized by a person skilled in this art. Without limitation, any and all equivalents described, signified or incorporated by reference in this patent application are specifically incorporated by reference into the description herein of the innovations, embodiments and/or examples. In addition, any and all variations described, signified or incorporated by reference herein with respect to any one embodiment are also to be considered taught with respect to all other embodiments. Any such variations include both currently known variations as well as future variations, for example any element used herein includes a future equivalent element that provides the same function, regardless of the structure of the future equivalent.

It is intended that the scope of the claimed inventions be defined and judged by the following claims and equivalents. The following claims are hereby incorporated into the Detailed Description, with each claim standing on its own as a separate embodiment. Disclosed embodiments can be described with more features than are expressly recited in the claims. 

What is claimed is:
 1. A method of converting a behavioral description language to a logic circuit, the behavioral description language comprising N force statements and M release statement applied to a net disposed in the logic circuit, the method comprising: forming N multiplexers each receiving a different one of N force signals, defined by the N force statements, at the multiplexer's first input terminal, wherein an output signal of ii multiplexer is supplied to a second input terminal of (i+1)^(th) multiplexer, wherein i is an integer ranging from 1 to N, and wherein a driver signal driving the net in the absence of the force statements is applied to a second input terminal of a first one of the N multiplexers; and forming a controller controlling select terminals of each of the N multiplexers in response to N force conditions and M release conditions, said controller being configured to: assert the select signal of the i^(th) multiplexer if the i^(th) force condition is active; and unassert the select signal of the i^(th) multiplexer if (i) the i^(th) force condition is inactive and a force condition other than the i^(th) force condition is active, or (ii) the i^(th) force condition is inactive and any one of the M release conditions is active, or (iii) the i^(th) force condition is dominated by a force condition other than the i^(th) force condition or (iv) the i^(th) force condition is dominated by any one of the M release conditions.
 2. The method of claim 1 wherein the method further comprises maintaining a previous value of the select signal of the i^(th) multiplexer if the select signal of the i^(th) multiplexer is neither asserted nor unasserted.
 3. The method of claim 1 wherein the i^(th) force statement dominates the j^(th) release statement if the i^(th) force statement appears below the j^(th) release in a same procedure statement, wherein j is an index varying from 1 to M.
 4. The method of claim 1 wherein the i^(th) force statement dominates the j^(th) release statement if the i^(th) force statement is disposed in a first procedure executed after a second procedure in which the j^(th) procedure is disposed, wherein j is an index varying from 1 to M.
 5. The method of claim 1 wherein the i^(th) release statement dominates the i^(th) force statement if the j^(th) release statement appears below the i^(th) release in a same procedure statement, wherein j is an index varying from 1 to M.
 6. The method of claim 1 wherein the j^(th) release statement dominates the i^(th) force statement if the j^(th) release statement is disposed in a first procedure executed after a second procedure in which the i^(th) procedure is disposed, wherein j is an index varying from 1 to M.
 7. A method of converting a behavioral description language to a logic circuit, the behavioral description language comprising N force statements and M release statement applied to a variable disposed in the logic circuit, the method comprising: forming N multiplexers each receiving a different one of N force signals defined by the N force statements at the multiplexer's first input terminal, wherein an output signal of i^(th) multiplexer is supplied to a second input terminal of (i+1)^(th) multiplexer, wherein i is an integer ranging from 1 to N, wherein a driver signal applied to the variable in the absence of the force statements is applied to a second input terminal of a first one of the N multiplexers, and wherein an output of the N^(th) multiplexer is applied to an input of a sustainer logic; and a controller controlling select terminals of each of the N multiplexers in response to N force conditions and M release conditions, said controller being configured to: assert the select signal of the i^(th) multiplexer if the i^(th) force condition is active; and unassert the select signal of the i^(th) multiplexer if (i) the i^(th) force condition is inactive and a force condition other than the i^(th) force condition is active, or (ii) the i^(th) force condition is inactive and any one of M release conditions is active, or (iii) the i^(th) force condition is dominated by a force condition other than the i^(th) force condition or (iv) the i^(th) force condition is dominated by any one of the M release conditions; and a sustainer logic configured to receive and latch an output of the N^(th) multiplexer until the variable becomes a target of an executed assignment statement.
 8. The method of claim 7 wherein said sustainer is defined by a state machine comprising normal, forced and released states, wherein a transition from the normal state to forced state occurs when a select terminal of any of the N multiplexers is asserted, and wherein a transition from the forced state to the normal state occurs when the select terminal of none of the N multiplexers is asserted and at least one of the N force conditions is active.
 9. The method of claim 8 wherein a transition from the forced state to the released state occurs when the select terminal of none of the N multiplexers is asserted and none of the N force conditions is active, and wherein a transition from the released state to the forced state occurs when a select terminal of any of the N multiplexers is asserted.
 10. The method of claim 9 wherein a transition from the released state to the normal state occurs when the select terminal of none of the N multiplexers is asserted and at least one of the N force conditions is active.
 11. The method of claim 10 wherein said sustainer further comprises: a multiplexer logic configured to receive a select signal that is asserted if the state machine is in the normal state or if the select terminal of any of the N multiplexers is asserted; said multiplexer logic comprising a first input terminal configured to receive an output signal of the N^(th) multiplexer and a second input terminal configured to receive a stored output of the multiplexer logic; and a flip flop configured to store the output of the multiplexer logic.
 12. A computer system configured to convert a behavioral description language to a logic circuit, the behavioral description language comprising N force statements and M release statement applied to a net disposed in the logic circuit, the computer system further configured to: form N multiplexers each receiving a different one of N force signals, defined by the N force statements, at the multiplexer's first input terminal, wherein an output signal of i^(th) multiplexer is supplied to a second input terminal of (i+1)^(th) multiplexer, wherein i is an integer ranging from 1 to N, and wherein a driver signal driving the net in the absence of the force statements is applied to a second input terminal of a first one of the N multiplexers; and form a controller controlling select terminals of each of the N multiplexers in response to N force conditions and M release conditions, said controller being configured to: assert the select signal of the i^(th) multiplexer if the i^(th) force condition is active; and unassert the select signal of the i^(th) multiplexer if (i) the i^(th) force condition is inactive and a force condition other than the i^(th) force condition is active, or (ii) the i^(th) force condition is inactive and any one of the M release conditions is active, or (iii) the i^(th) force condition is dominated by a force condition other than the i^(th) force condition or (iv) the i^(th) force condition is dominated by any one of the M release conditions.
 13. The computer system of claim 12 wherein the computer system is further configured to maintain a previous value of the select signal of the i^(th) multiplexer if the select signal of the i^(th) multiplexer is neither asserted nor unasserted.
 14. The computer system of claim 12 wherein the i^(th) force statement dominates the j^(th) release statement if the i^(th) force statement appears below the j^(th) release in a same procedure statement, wherein j is an index varying from 1 to M.
 15. The computer system of claim 12 wherein the i^(th) force statement dominates the j^(th) release statement if the i^(th) force statement is disposed in a first procedure executed after a second procedure in which the j^(th) procedure is disposed, wherein j is an index varying from 1 to M.
 16. The computer system of claim 12 wherein the i^(th) release statement dominates the i^(th) force statement if the j^(th) release statement appears below the i^(th) release in a same procedure statement, wherein j is an index varying from 1 to M.
 17. The computer system of claim 12 wherein the j^(th) release statement dominates the i^(th) force statement if the j^(th) release statement is disposed in a first procedure executed after a second procedure in which the i^(th) procedure is disposed, wherein j is an index varying from 1 to M.
 18. A computer system configured to convert a behavioral description language to a logic circuit, the behavioral description language comprising N force statements and M release statement applied to a variable disposed in the logic circuit, the computer system further configured to: form N multiplexer each receiving a different one of N force signals defined by the N force statements at the multiplexer's first input terminal, wherein an output signal of i^(th) multiplexer is supplied to a second input terminal of (i+1)^(th) multiplexer, wherein i is an integer ranging from 1 to N, wherein a driver signal applied to the variable in the absence of the force statements is applied to a second input terminal of a first one of the N multiplexers, and wherein an output of the N^(th) multiplexer is applied to an input of a sustainer logic; and form a controller controlling select terminals of each of the N multiplexers in response to N force conditions and M release conditions, said controller being configured to: assert the select signal of the i^(th) multiplexer if the i^(th) force condition is active; and unassert the select signal of the i^(th) multiplexer if (i) the i^(th) force condition is inactive and a force condition other than the i^(th) force condition is active, or (ii) the i^(th) force condition is inactive and any one of M release conditions is active, or (iii) the i^(th) force condition is dominated by a force condition other than the i^(th) force condition or (iv) the i^(th) force condition is dominated by any one of the M release conditions; and form a sustainer logic configured to receive and latch an output of the N^(th) multiplexer until the variable becomes a target of an executed assignment statement.
 19. The computer system of claim 18 wherein said sustainer is defined by a state machine comprising normal, forced and released states, wherein a transition from the normal state to forced state occurs when a select terminal of any of the N multiplexers is asserted, and wherein a transition from the forced state to the normal state occurs when the select terminal of none of the N multiplexers is asserted and at least one of the N force conditions is active.
 20. The computer system of claim 19 wherein a transition from the forced state to the released state occurs when the select terminal of none of the N multiplexers is asserted and none of the N force conditions is active, and wherein a transition from the released state to the forced state occurs when a select terminal of any of the N multiplexers is asserted.
 21. The computer system of claim 20 wherein a transition from the released state to the normal state occurs when the select terminal of none of the N multiplexers is asserted and at least one of the N force conditions is active.
 22. The computer system of claim 21 wherein said sustainer further comprises: a multiplexer logic configured to receive a select signal that is asserted if the state machine is in the normal state or if the select terminal of any of the N multiplexers is asserted; said multiplexer logic comprising a first input terminal configured to receive an output signal of the N^(th) multiplexer and a second input terminal configured to receive a stored output of the multiplexer logic; and a flip flop configured to store the output of the multiplexer logic. 